Automaton semigroups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automaton semigroups

The concept of an automaton group generalizes easily to semigroups, and the systematic study of this area is beginning. This paper aims to contribute to that study. The basic theory of automaton semigroups is briefly reviewed. Various natural semigroups are shown to arise as automaton semigroups. The interaction of certain semigroup constructions with the class of automaton semigroups is studie...

متن کامل

Automatic semigroups vs automaton semigroups

We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup, namely the semigroup generated by a Mealy automaton encoding the behaviour of such a language of greedy normal forms under one-sided multiplication. The framework embraces many of the well-known classes of (automatic) semigroups: free semigroups,...

متن کامل

Cayley Automaton Semigroups

In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.

متن کامل

Decidability problems in automaton semigroups

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of X. We describe algorithms answering the word problem, and bound its complexity under some additional assumptions. We give a partial algorithm that decides in a group generated by an automaton, given x, y, whether an Engel identity (r ̈ ̈ ̈ rrx, ys, ys, . . . , ys “ 1 for ...

متن کامل

Automaton semigroups: New constructions results and examples of non-automaton semigroups

This paper studies the class of automaton semigroups from two perspectives: closure under constructions, and examples of semigroups that are not automaton semigroups. We prove that (semigroup) free products of finite semigroups always arise as automaton semigroups, and that the class of automaton monoids is closed under forming wreath products with finite monoids. We also consider closure under...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2009

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2009.07.054